Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited

نویسندگان

  • Awi Federgruen
  • Michal Tzur
چکیده

We show for the general dynamic lot sizing model how minimal forecast horizons may be detected by a slight adaptation of an earlier 0(n log n) or 0(n) forward solution method for the model. A detailed numerical study indicates that minimal forecast horizons tend to be small, that is, include a small number of orders. We describe a new planning approach to ensure stability of the lot sizing decisions over an initial interval of time or stability horizon in those (relatively rare) cases where no planning horizon is detected or where the stability horizon extends beyond the planning horizon. To this end, we develop a heuristic, butfull horizon-based adaptation of the optimal lot sizing schedule, designed to minimize an upper bound for the worst-case optimality gap under the desired stability conditions. We also show how the basic horizon length n may be chosen to guarantee any prespecified positive optimality gap.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models

n most dynamic planning problems, one observes that an optimal decision at any given stage Idepends on limited information, i.e. information pertaining to a limited set of adjacent or nearby stages. This holds in particular for planning problems over time, where an optimal decision in a given period depends on information related to a limited future time horizon, a so-called forecast horizon, o...

متن کامل

Computing Minimal Forecast Horizons: An Integer Programming Approach

In this paper, we use integer programming (IP) to compute minimal forecast horizons for the classical dynamic lot-sizing problem (DLS). As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. It is our belief that the modelling and structural advantages of the IP approach coupled with the recent significant developments in ...

متن کامل

Minimal Forecast Horizons: An Integer Programming Approach

The concept of a forecast horizon has been widely studied in the operations management/research literature in the context of evaluating the impact of future data on current decisions in a multi-period decision making environment. As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. However, the modelling and structural a...

متن کامل

Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

متن کامل

Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand

We present structural and computational investigations of a new class of weak forecast horizons – minimal forecast horizons under the assumption that future demands are integer multiples of a given positive real number – for a specific class of dynamic lot-size (DLS) problems. Apart from being appropriate in most practical instances, the discreteness assumption offers a significant reduction in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1994